structural recursion การใช้

The examples in this section illustrate what is known as " structural recursion ".
Structural recursion is usually proved correct by structural induction; in particularly easy cases, the inductive step is often left out.
Since their introduction, inductive types have been extended to encode more and more structures, while still being predicative and supporting structural recursion.
Structural recursion includes nearly all tree traversals, including XML processing, binary tree creation and search, etc . By considering the algebraic structure of the natural numbers ( that is, a natural number is either zero or the successor of a natural number ), functions such as factorial may also be regarded as structural recursion.
Structural recursion includes nearly all tree traversals, including XML processing, binary tree creation and search, etc . By considering the algebraic structure of the natural numbers ( that is, a natural number is either zero or the successor of a natural number ), functions such as factorial may also be regarded as structural recursion.